Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization
نویسندگان
چکیده
The Minimum Label Spanning Tree Problem is a well known combinatorial optimization problem, having applications in telecommunication network design and data compression. The problem is NP-hard and cannot be approximated within a constant factor. In this work we present the application of ant colony optimization to this problem. Different pheromone models and construction mechanisms are introduced and local improvement methods are considered. An experimental investigation of the outlined components and a comparison to existing work are
منابع مشابه
OPTIMIZATION OF TREE-STRUCTURED GAS DISTRIBUTION NETWORK USING ANT COLONY OPTIMIZATION: A CASE STUDY
An Ant Colony Optimization (ACO) algorithm is proposed for optimal tree-structured natural gas distribution network. Design of pipelines, facilities, and equipment systems are necessary tasks to configure an optimal natural gas network. A mixed integer programming model is formulated to minimize the total cost in the network. The aim is to optimize pipe diameter sizes so that the location-alloc...
متن کاملOn the Minimum Label Spanning Tree Problem Solution Methods and Applications
The minimum label spanning tree problem is a combinatorial optimization problem with applications in telecommunication network design with the goal of deriving a network that is preferably uniform w.r.t. to the used communication facilities. For the minimum label spanning tree problem we are given a connected graph with labels associated to its edges. The goal is to derive a spanning tree requi...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Ant Colony Optimization and the Minimum Spanning Tree Problem
Ant Colony Optimization (ACO) is a kind of randomized search heuristic that has become very popular for solving problems from combinatorial optimization. Solutions for a given problem are constructed by a random walk on a so-called construction graph. This random walk can be influenced by heuristic information about the problem. In contrast to many successful applications, the theoretical found...
متن کاملA Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems
This paper considers an efficient approximate algorithm for solving k-minimum spanning tree problems which is one of the combinatorial optimization in networks. A new hybrid algorithm based on tabu search and ant colony optimization is provided. Results of numerical experiments show that the proposed method updates some of the best known values with very short time and that the proposed method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010